Optimal trees for functions of internal distance
نویسندگان
چکیده
منابع مشابه
Optimal Distance Labeling Schemes for Trees
Labeling schemes seek to assign a short label to each node in a network, so that a function on two nodes (such as distance or adjacency) can be computed by examining their labels alone. For the particular case of trees, following a long line of research, optimal bounds (up to low order terms) were recently obtained for adjacency labeling [FOCS ’15], nearest common ancestor labeling [SODA ’14], ...
متن کاملOptimal Facility Location under Various Distance Functions
We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...
متن کاملNote on Optimal Trees for Parallel Hash Functions
A recent work [2] shows how we can optimize a tree based mode of operation for a rate 1 hash function. In particular, an algorithm and a theorem are presented for selecting a good tree topology in order to optimize both the running time and the number of processors at each step of the computation. Because this paper deals only with trees having their leaves at the same depth, the number of save...
متن کاملTowards optimal distance functions for stochastic substitution models.
Distance based reconstruction methods of phylogenetic trees consist of two independent parts: first, inter-species distances are inferred assuming some stochastic model of sequence evolution; then the inferred distances are used to construct a tree. In this paper we concentrate on the task of inter-species distance estimation. Specifically, we characterize the family of valid distance functions...
متن کاملOptimal algorithms for computing the Robinson and Foulds topologic distance between two trees and the strict consensus trees of k trees given their distance matrices
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting species relationships is associated with a matrix of distances between the species considered and called a distance matrix or a tree metric matrix. A circular order of elements of X corresponds to a circular (clockwise) sca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2012
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2012.5.371